Chromatic numbers of the strong product of odd cycles
نویسندگان
چکیده
منابع مشابه
Guessing Numbers of Odd Cycles
For a given number of colours, s, the guessing number of a graph is the base s logarithm of the size of the largest family of colourings of the vertex set of the graph such that the colour of each vertex can be determined from the colours of the vertices in its neighbourhood. An upper bound for the guessing number of the n-vertex cycle graph Cn is n/2. It is known that the guessing number equal...
متن کاملSmall odd cycles in 4-chromatic graphs
It is shown that every 4-chromatic graph on n vertices contains an odd cycle of length less than 2 p n3. This improves the previous bound given by Nilli [J Graph Theory 3 (1999), 145±147]. ß 2001 John Wiley & Sons, Inc. J Graph Theory 37: 115±117, 2001
متن کامل3-colored Ramsey Numbers of Odd Cycles
Recently we determined the Ramsey Number r(C7, C7, C7) = 25. Let G = (V (G), E(G)) be an undirected finite graph without any loops or multiple edges, where V (G) denotes its vertex set and E(G) its edge set. In the following we will often consider the complete graph Kp on p vertices and the cycle Cp on p vertices. A k−coloring (F1, F2, . . . , Fk) of a graph G is a coloring of the edges of G wi...
متن کاملRamsey Numbers of Trees Versus Odd Cycles
Burr, Erdős, Faudree, Rousseau and Schelp initiated the study of Ramsey numbers of trees versus odd cycles, proving that R(Tn, Cm) = 2n− 1 for all odd m > 3 and n > 756m10, where Tn is a tree with n vertices and Cm is an odd cycle of length m. They proposed to study the minimum positive integer n0(m) such that this result holds for all n > n0(m), as a function of m. In this paper, we show that ...
متن کاملStrong total chromatic numbers of complete hypergraphs
We determine the strong total chromatic number of the complete h-uniform hypergraph Kh, and the complete h-partite hypergraph K,
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2002
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00111-8